Partial strong structural controllability

Zero forcing number, constrained matchings and strong structural controllability

The zero forcing number is a graph invariant introduced in order to study the minimum rank of the graph. In the first part of this paper, we first highlight that the computation of the zero forcing number of any directed graph (allowing loops) is NP-hard. Furthermore, we identify a class of directed trees for which the zero forcing number is computable in linear time. The second part of the pap...

Zero forcing number, constraint matchings and strong structural controllability

The zero forcing number is a graph invariant introduced in order to study the minimum rank of the graph. In the first part of this paper, we first highlight that the computation of the zero forcing number of any directed graph (allowing loops) is NP-hard. Furthermore, we identify a class of directed trees for which the zero forcing number is computable in linear time. The second part of the pap...

Strong Structural Controllability of Linear Time-Varying Systems

In this note we consider continuous-time systems ẋ(t) = A(t)x(t) + B(t)u(t) as well as discrete-time systems x(t + 1) = A(t)x(t) + B(t)u(t) whose coefficient matrices A and B are not exactly known. More precisely, all that is known about the systems is their nonzero pattern, i.e., the locations of the nonzero entries in the coefficient matrices. We characterize the patterns that guarantee contr...

Structural Controllability of Multi-Agent Systems Subject to Partial Failure

Structural Controllability of Multi-Agent Systems Subject to Partial Failure Saeid Jafari Formation control of multi-agent systems has emerged as a topic of major interest during the last decade, and has been studied from various perspectives using different approaches. This work considers the structural controllability of multiagent systems with leader-follower architecture. To this end, graph...

Controllability of partial differential equations